Satis ability in fuzzy logics
نویسنده
چکیده
The notion of validation set of a formula in a fuzzy logic was introduced by Butnariu, Klement and Zafrany. It is the set of all evaluations of the formula for all possible evaluations of its atomic symbols. We generalize this notion to sets of formulas. This enables us to formulate and prove generalized theorems on satissability and compactness of various fuzzy logics. We also propose and study new types of satissability and consistency degree of a set of formulas.
منابع مشابه
Monadic Fuzzy Predicate Logics
Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to nite model property (properties) and arithmetical complexity of sets of tautologies, satis-able formulas and of analogous notion restricted to nite models.
متن کاملOn Modal and Fuzzy Decision Logics Based on Rough Set Theory
Some modal decision logic languages are proposed for knowledge representation in data mining through the notions of models and satis£ability. The models are collections of data tables consisting of a £nite set of objects described by a £nite set of attributes. Some relationships may exist between data tables in a collection and the modalities of our languages are interpreted with respect to the...
متن کاملA Correspondence between Temporal Description Logics
Description Logics (DLs) are formalisms for representing and reasoning about conceptual knowledge. There exist several extensions of DLs for an appropriate integration of temporal knowledge [4]. This paper investigates the relation between the two DLs T L-ALCF [2, 3] and ALCF(D) [10, 8]. T L-ALCF is an interval-based, temporal DL for reasoning about objects whose properties vary over time. ALCF...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملSatis ability problem in description logics with modal operators
The paper considers the standard concept description language ALC augmented with various kinds of modal operators which can be applied to concepts and axioms. The main aim is to develop methods of proving decidability of the satis ability problem for this language and apply them to description logics with most important temporal and epistemic operators, thereby obtaining satis ability checking ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000